Totally unimodular Leontief directed hypergraphs
نویسندگان
چکیده
منابع مشابه
Totally unimodular stochastic programs
We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...
متن کاملTotally Unimodular Congestion Games
We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players’ strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class. In the symmetric case, when all players have the same strategy set, we design an algorithm that finds an optimal aggregated strategy and...
متن کاملPartial Colorings of Unimodular Hypergraphs
Combinatorial discrepancy theory asks for vertex-colorings of hypergraphs such that all hyperedges contain all colors in (as good as possible) equal quantity. Unimodular hypergraphs are good in this sense: They (and all their induced subhypergraphs as well) can be two-colored in a way that in each hyperedge the number of vertices in one color deviates from that in the other color by at most one...
متن کاملTotally unimodular multistage stochastic programs
We consider totally unimodular multistage stochastic programs, that is, multistage stochastic programs whose extensive-form constraint matrices are totally unimodular. We establish several sufficient conditions and identify examples that have arisen in the literature.
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1995
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00369-b